Closed Linkages and Poristic Polygons
نویسندگان
چکیده
منابع مشابه
Multiple Coverings with Closed Polygons
A planar set P is said to be cover-decomposable if there is a constant k = k(P ) such that every k-fold covering of the plane with translates of P can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane wi...
متن کاملChain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
A polygonal linkage or chain is a sequence of segments of fixed lengths, free to turn about their endpoints, which act as joints. This paper reviews some results in chain reconfiguration and highlights several open problems We consider a sequence of closed straight line segments [A0, A1], [A1, A2], . . . [An−1, An] of fixed lengths l1, l2, . . . ln, respectively, imagining that these line segme...
متن کاملLiouville-Arnold integrability of the pentagram map on closed polygons
The pentagram map is a discrete dynamical system defined on the moduli space of polygons in the projective plane. This map has recently attracted a considerable interest, mostly because its connection to a number of different domains, such as: classical projective geometry, algebraic combinatorics, moduli spaces, cluster algebras and integrable systems. Integrability of the pentagram map was co...
متن کاملRandomized path planning for linkages with closed kinematic chains
951 planning problem, with proven features as long as the tracking is good enough, and one tracking problem. The tracking problem is solved for a class of nonholonomic robots of the unicycle type, and we illustrate the soundness of our method by applying it to rigid body constrained motions. ACKNOWLEDGMENT The authors would like to thank the three anonymous reviewers for their insightful commen...
متن کاملPartial Innation of Closed Polygons in the Plane
Innation for simply closed regular curves in the plane has been investigated rst by S. A. Robertson 4] and studied in some more detail in 5]. It consists of an innnite iteration of reeections of parts of the curve at supporting double tangents, hopefully leading to a convex limit curve which has the same arc length as the original curve. The same procedure easily can be deened for simply closed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 1914
ISSN: 0024-6115
DOI: 10.1112/plms/s2-13.1.199